A multivariate framework for weighted FPT algorithms
نویسندگان
چکیده
منابع مشابه
A multivariate framework for weighted FPT algorithms
We present a general framework for solving parameterized problems on weighted graphs. We use this framework to obtain efficient algorithms for such fundamental problems as Vertex Cover, 3-Hitting Set, Edge Dominating Set and k-Internal Out-Branching, on weighted graphs. For each of these problems, given an instance of size n and a weight parameter W ≥ 1, we seek a solution of weight at most (or...
متن کاملRuling out FPT algorithms for Weighted Coloring on forests
Given a graph G, a proper k-coloring of G is a partition c = (Si)i∈[1,k] of V (G) into k stable sets S1, . . . , Sk. Given a weight function w : V (G) → R +, the weight of a color Si is defined as w(i) = maxv∈Si w(v) and the weight of a coloring c as w(c) = ∑k i=1w(i). Guan and Zhu [Inf. Process. Lett., 1997] defined the weighted chromatic number of a pair (G,w), denoted by σ(G,w), as the minim...
متن کاملA New Framework for Distributed Multivariate Feature Selection
Feature selection is considered as an important issue in classification domain. Selecting a good feature through maximum relevance criterion to class label and minimum redundancy among features affect improving the classification accuracy. However, most current feature selection algorithms just work with the centralized methods. In this paper, we suggest a distributed version of the mRMR featu...
متن کاملWeighted Tensor Product Algorithms for Linear Multivariate Problems
We study the "-approximation of linear multivariate problems deened over weighted tensor product Hilbert spaces of functions f of d variables. A class of weighted tensor product (WTP) algorithms is deened which depends on a number of parameters. Two classes of permissible information are studied. all consists of all linear functionals while std consists of evaluations of f or its derivatives. W...
متن کاملFast FPT-Algorithms for Cleaning Grids
We consider the problem that, given a graph G and a parameter k, asks whether the edit distance of G and a rectangular grid is at most k. We examine the general case where the edit operation are vertex/edge removals and additions. If the dimensions of the grid are given in advance, then we give a parameterized algorithm that runs in 2 k·k) +O(n) steps. In the case where the dimensions of the gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2017
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2017.05.003